Three Bijections on Set Partitions
نویسنده
چکیده
We study three similar bijections on set partitions. The first gives a bijective proof of the equivalence of two statistics with a q-Stirling distribution, Milne’s statistic and the intertwining number. The second proves the equivalence of a multivariate block size distribution to a covering statistic. The third demonstrates equivalence of the number of all set partitions up to a given size to set partitions of a larger size with second block a singleton.
منابع مشابه
Some Bijections on Set Partitions
We study three similar bijections on set partitions. The first is an involution defined by Kasraoui and Zeng which proves the symmetry of the distribution of crossings and nestings. We show that a stronger result can be deduced. The second gives a bijective proof of the equivalence of two statistics with a q-Stirling distribution. The third proves the equivalence of a multivariate block size di...
متن کاملMullineux involution and twisted affine Lie algebras
We use Naito-Sagaki’s work [S. Naito & D. Sagaki, J. Algebra 245 (2001) 395–412, J. Algebra 251 (2002) 461–474] on LakshmibaiSeshadri paths fixed by diagram automorphisms to study the partitions fixed by Mullineux involution. We characterize the set of Mullineux-fixed partitions in terms of crystal graph of basic representations of twisted affine Lie algebras of type A (2) 2l and of type D (2) ...
متن کاملNon-crossing Partitions, Non-nesting Partitions and Coxeter Sortable Elements in Types a and B
First, we investigate a generalization of the area statistic on Dyck paths for all crystallographic reflection groups. In particular, we explore Dyck paths of type B together with an area statistic and a major index. Then, we construct bijections between non-nesting and reverse non-crossing partitions for types A and B. These bijections simultaneously send the area statistic and the major index...
متن کاملDistribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions
We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes a recent result of Klazar and Noy in perfect matchings. By factorizing our involution through bijections between set partitions and some path diagrams ...
متن کاملCrossings and Nestings in Set Partitions of Classical Types
We study bijections { Set partitions of type X } −̃→ { Set partitions of type X } for X ∈ {A,B,C,D}, which preserve openers and closers. In types A, B, and C, they interchange • either the number of crossings and of nestings, • or the cardinalities of a maximal crossing and of a maximal nesting. In type D, the results are obtained only in the case of non-crossing and nonnesting set partitions. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007